Primal-dual approximation algorithms for a packing-covering pair of problems
نویسندگان
چکیده
منابع مشابه
Primal-dual approximation algorithms for a packing-covering pair of problems
We consider a special packing-covering pair of problems. The packing problem is a natural generalization of finding a (weighted) maximum independent set in an interval graph, the covering problem generalizes the problem of finding a (weighted) minimum clique cover in an interval graph. The problem pair involves weights and capacities; we consider the case of unit weights and the case of unit ca...
متن کاملOnline Primal-Dual Algorithms for Covering and Packing Problems
We study a wide range of online covering and packing optimization problems. In an online covering problem a linear cost function is known in advance, but the linear constraints that define the feasible solution space are given one by one in an online fashion. In an online packing problem the profit function as well as the exact packing constraints are not fully known in advance. In each round a...
متن کاملOnline Primal-Dual Algorithms for Covering and Packing
We study a wide range of online covering and packing optimization problems. In an online covering problem, a linear cost function is known in advance, but the linear constraints that define the feasible solution space are given one by one, in rounds. In an online packing problem, the profit function as well as the packing constraints are not known in advance. In each round additional informatio...
متن کاملApproximation Algorithms for Covering and Packing Problems on Paths
Routing and scheduling problems are fundamental problems in combinatorial optimization, and also have many applications. Most variations of these problems are NP-Hard, so we need to use heuristics to solve these problems on large instances, which are fast and yet come close to the optimal value. In this thesis, we study the design and analysis of approximation algorithms for such problems. We f...
متن کاملFast Approximation Algorithms for Fractional Packing and Covering Problems
Thii paper presents fast algorithms that find approximate solutions for a general class of problems, which we call fractional packing and covering problems. The only previously known algorithms for solving these problems are based on general linear programming techniiues. The techniques developed in this paper greatly outperform the general methods in many applications, and are extensions of a ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: RAIRO - Operations Research
سال: 2002
ISSN: 0399-0559,1290-3868
DOI: 10.1051/ro:2002005